Hamiltonian matrix

In mathematics, a Hamiltonian matrix A is any real 2n × 2n matrix A that satisfies the condition that KA is symmetric, where K is the skew-symmetric matrix

K=
\begin{bmatrix}
0 & I_n \\
-I_n & 0 \\
\end{bmatrix}

and In is the n × n identity matrix. In other words, A is Hamiltonian if and only if

KA - A^T K^T = KA %2B A^T K = 0.\,

In the vector space of all 2n × 2n matrices, Hamiltonian matrices form a subspace of dimension 2n2 + n.

Contents

Properties

M = \begin{pmatrix}A & B \\ C & D\end{pmatrix}
where A, B, C, and D are n × n matrices. Then M is a Hamiltonian matrix provided that the matrices B and C are symmetric, and that A + DT = 0.

Hamiltonian operators

Let V be a vector space, equipped with a symplectic form Ω. A linear map A:\; V \mapsto V is called a Hamiltonian operator with respect to Ω if the form x, y \mapsto \Omega(A(x), y) is symmetric. Equivalently, it should satisfy

\Omega(A(x), y)=-\Omega(x, A(y))

Choose a basis e1, ... e2n in V, such that Ω is written as \sum_i e_i \wedge e_{n%2Bi}. A linear operator is Hamiltonian with respect to Ω if and only if its matrix in this basis is Hamiltonian.[2]

From this definition, the following properties are apparent. A square of a Hamiltonian matrix is skew-Hamiltonian. An exponential of a Hamiltonian matrix is symplectic, and a logarithm of a symplectic matrix is Hamiltonian.

See also

References

Notes

  1. ^ Dragt, Alex J. (2005), "The symplectic group and classical mechanics", Annals of the New York Academy of Sciences 1045 (1): 291–307, doi:10.1196/annals.1350.025 .
  2. ^ Waterhouse, William C. (2005), "The structure of alternating-Hamiltonian matrices", Linear Algebra and its Application 396: 385–390, doi:10.1016/j.laa.2004.10.003 .